Weighted automata and weighted logics on innite words
نویسندگان
چکیده
We introduce weighted automata over in nite words with Muller acceptance condition and we show that their behaviors coincide with the semantics of weighted restricted MSO-sentences. Furthermore, we establish an equivalence property of weighted Muller and weighted Büchi automata over certain semirings. Keywords: Weighted logics, Weighted Muller automata, In nitary formal power series, Weighted Büchi automata. Mathematics Subject Classi cation: 68Q45, 03B50, 03B70.
منابع مشابه
Weighted Automata and Weighted Logics on Infinite Words
We introduce weighted automata over infinite words with Muller acceptance condition and we show that their behaviors coincide with the semantics of weighted restricted MSOsentences. Furthermore, we establish an equivalence property of weighted Muller and weighted Büchi automata over certain semirings. DOI: 10.3103/S1066369X10010044
متن کاملWeighted Automata and Logics on Graphs
Weighted automata model quantitative features of the behavior of systems and have been investigated for various structures like words, trees, traces, pictures, and nested words. In this paper, we introduce a general model of weighted automata acting on graphs, which form a quantitative version of Thomas’ unweighted model of graph acceptors. We derive a Nivat theorem for weighted graph automata ...
متن کاملWeighted Automata and Logics for Infinite Nested Words
Nested words introduced by Alur and Madhusudan are used to capture structures with both linear and hierarchical order, e.g. XML documents, without losing valuable closure properties. Furthermore, Alur and Madhusudan introduced automata and equivalent logics for both finite and infinite nested words, thus extending Büchi’s theorem to nested words. Recently, average and discounted computations of...
متن کاملWeighted Automata and Weighted Logics over Tree-like Structures
In theoretical computer science the connection between automata and logic is of fundamental importance. This connection was first considered by Büchi and Elgot in the 1960s, when they showed that the languages accepted by finite automata are precisely those languages that can be defined in monadic second-order logic (MSO). In this thesis we consider extensions of Büchi’s and Elgot’s theorem int...
متن کاملA unifying survey on weighted logics and weighted automata - Core weighted logic: minimal and versatile specification of quantitative properties
Logical formalisms equivalent to weighted automata have been the topic of numerous research papers in the recent years. It started with the seminal result by Droste and Gastin on weighted logics over semirings for words. It has been extended in two dimensions by many authors. First, the weight domain has been extended to valuation monoids, valuation structures, etc., to capture more quantitativ...
متن کامل